Decision Trees for Helpdesk Advisor Graphs
نویسندگان
چکیده
We use decision trees to build a helpdesk agent reference network to facilitate the on-the-job advising of junior or less experienced staff on how to better address telecommunication customer fault reports. Such reports generate field measurements and remote measurements which, when coupled with location data and client attributes, and fused with organization-level statistics, can produce models of how support should be provided. Beyond decision support, these models can help identify staff who can act as advisors, based on the quality, consistency and predictability of dealing with complex troubleshooting reports. Advisor staff models are then used to guide less experienced staff in their decision making; thus, we advocate the deployment of a simple mechanism which exploits the availability of staff with a sound track record at the helpdesk to act as dormant tutors.
منابع مشابه
Building a Decision Tree Model for Academic Advising Affairs Based on the Algorithm C 4-5
The ability to recognize students’ weakness and solve any problem that may confront them in timely fashion is always a target for all educational institutions. Thus, colleges and universities implement the so-called academic advising affairs. On the academic advisor relies the responsibility of solving any problem that may confront students’ learning progress. This paper shows how the advisor c...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملRoman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملMixed Culture of Commensal Bacteria Reduces E. Coli in Nursery Pigs
ORAL PRESENTATIONS of the advised control measures on the Salmonella prevalence at the farm based on this research due to the limited number of farms. The adjusted HACCP methodology is useful to determine weak points and the control measures in a structured way for, in this case, reducing the risk of introduction and spread of Salmonella at a pig finishing farm. The decision trees are a useful ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1710.07075 شماره
صفحات -
تاریخ انتشار 2017